A GROOVE Solution for the BPMN to BPEL Model Transformation

In this paper we present a solution of a model transformation between two standard languages for business process modeling BPMN and BPEL, using the GROOVE tool set. GROOVE is a tool for graph transformations that uses directed, edge labelled simple graphs and the SPO approach [Ren04]. Given a graph grammar (G, P), composed of a start graph G and a set of production rules P, the tool allows to compute a labelled transition system (LTS) corresponding to all possible derivations in this grammar. The tool is freely available for download. The latest version and documentation can be found on the website http://sourceforge.net/projects/groove. The graph grammar presented here as well as detailed description of the sample realization to the case study is available in the attachment

Flow Diagram Decomposition Using Graph Transformations

The key challenge of model transformations in model-driven development is in transforming higher-level abstract models into more concrete ones that can be used to generate implementation level models, including executable business process representations and program code. Many of the modelling languages (like UML Activity Diagrams or BPMN) use unstructured flow graphs to describe the operation sequence of a business process. If a structured language is chosen as the executable representation, it is difficult to compile the unstructured flows into structured statements. Even if a target language structure contains goto-like statements it is often simpler and more efficient to deal with programs that have structured control flow to make the executable representation more understandable. In this paper, we take a first step towards an implementation of existing decomposition methods using graph transformations, and we evaluate their effectiveness with a view to readability and essential complexity measures

Towards model structuring based on flow diagram decomposition

The key challenge of model transformations in model-driven development is in transforming higher-level abstract models into more concrete ones that can be used to generate implementation level models, including executable business process representations and program code. Many of the modelling languages (like UML Activity Diagrams or BPMN) use unstructured flow graphs to describe the operation sequence of a business process. If a structured language is chosen as the executable representation, it is difficult to compile the unstructured flows into structured statements. Even if a target language structure contains goto-like statements it is often simpler and more efficient to deal with programs that have structured control flow to make the executable representation more understandable. In this paper, we take a first step towards an implementation of existing decomposition methods using graph transformations, and we evaluate their effectiveness with a view to readability and essential complexity measures